BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2014/newsitem/5649/3-A
 pril-2014-Algebra|Coalgebra-Seminar-Fatemeh-Seifan
DTSTAMP:20140327T000000
SUMMARY:Algebra|Coalgebra Seminar, Fatemeh Seifan
ATTENDEE;ROLE=Speaker:Fatemeh Seifan
DTSTART;TZID=Europe/Amsterdam:20140403T160000
DTEND;TZID=Europe/Amsterdam:20140403T173000
LOCATION:Room F1.15, Science Park 107
DESCRIPTION:Abstract  In this talk we will use the
  connection between automata and logic to prove th
 at a wide class of coalgebraic fixpoint logics enj
 oy the uniform interpolation. To this aim, first w
 e generalize one of the central results in coalgeb
 raic automata theory, namely closure under project
 ion, which is known to hold for weak-pullback pres
 erving functors, to a more general class of functo
 rs, i.e.; functors with quasi-functorial lax exten
 sions. Then we will show thatclosure under project
 ion implies definability of the bisimulation quant
 ifier in the language of coalgebraic fixpoint logi
 c, and finally we prove the uniform interpolation 
 theorem.  For more information, see https://www.il
 lc.uva.nl/alg-coalg/ or contact Sumit Sourabh (S.S
 ourabh at uva.nl).
X-ALT-DESC;FMTTYPE=text/html:\n        <p><b>Abstr
 act</b><br/>\n        In this talk we will use the
  connection between automata and logic to prove th
 at a wide class of coalgebraic fixpoint logics enj
 oy the uniform interpolation. To this aim, first w
 e generalize one of the central results in coalgeb
 raic automata theory, namely closure under project
 ion, which is known to hold for weak-pullback pres
 erving functors, to a more general class of functo
 rs, i.e.; functors with quasi-functorial lax exten
 sions. Then we will show thatclosure under project
 ion implies definability of the bisimulation quant
 ifier in the language of coalgebraic fixpoint logi
 c, and finally we prove the uniform interpolation 
 theorem.</p>\n    \n        <p>For more informatio
 n, see <a target="_blank" href="https://www.illc.u
 va.nl/alg-coalg/">https://www.illc.uva.nl/alg-coal
 g/</a> or contact Sumit Sourabh (<a class="email">
 S.Sourabh <span class="at">at</span> uva.nl</a>).<
 /p>\n    
URL:/NewsandEvents/Archives/2014/newsitem/5649/3-A
 pril-2014-Algebra|Coalgebra-Seminar-Fatemeh-Seifan
END:VEVENT
END:VCALENDAR